Generalized G-KKM Theorems in Generalized Convex Spaces and Their Applications

Some new generalized G-KKM and generalized S-KKM theorems are proved under the noncompact setting of generalized convex spaces. As applications, some new minimax inequalities, saddle point theorems, a coincidence theorem, and a fixed point theorem are given in generalized convex spaces. These theorems improve and generalize many important known results in recent literature.     

Identification of regions of fastest mixing in a system of point vortices

This paper describes a numerical method for efficiently identifying the regions of fastest mixing of a passive dye in a flow due to a system of point vortices. Results obtained from computations are presented for systems of three and four point vortices, both in the unbounded domain and inside a circular cylinder. The flow is two‐dimensional and the fluid is incompressible. The regions where mixing is possible are found by studying the largest Lagrangian Lyapunov exponent distribution with respect to various initial positions of tracer particles. The regions of fastest mixing are then identified from the Lyapunov exponent distribution at small times. The results of the method are verified by quantifying the mixing by using a traditional box counting technique. The technique is then applied to several different initial configurations of vortices and some interesting results are obtained. Some numerical findings about the nature of the exponents computed are also discussed. Copyright © 2002 John Wiley Sons, Ltd.     

Global Optimization using a Dynamical Systems Approach

We develop new algorithms for global optimization by combining well known branch and bound methods with multilevel subdivision techniques for the computation of invariant sets of dynamical systems. The basic idea is to view iteration schemes for local optimization problems – e.g. Newton’s method or conjugate gradient methods – as dynamical systems and to compute set coverings of their fixed points. The combination with bounding techniques allow for the computation of coverings of the global optima only. We show convergence of the new algorithms and present a particular implementation. Michael Dellnitz - Research of the authors is partially supported by the Deutsche Forschungsgemeinschaft within the Sonderforschungsbereich 376     

测度链上非线性m-点边值问题的正解

设T是一个测度链(时间标架)并且0,T∈T．讨论测度链上m-点边值问题其中a∈Cld((0,T),[0,∞)),f∈C((0,T)X[0,∞),[0,∞)),β,γ∈[0,∞),ξ∈(0,ρ(T)), ai∈[0,∞)(i=1,．．．,m-2)是一些满足适当条件的定常数．借助于锥上的不动点定理,得到了此问题存在单个及多个正解的一些新的更一般的结果．特别地,我们的结果推广并改进了一些已有的结论．     

Algorithms with high order convergence speed for blind source extraction

A rigorous convergence analysis for the fixed point ICA algorithm of Hyvärinen and Oja is provided and a generalization of it involving cumulants of an arbitrary order is presented. We consider a specific optimization problem OP(p), p>3, integer, arising from a Blind Source Extraction problem (BSE) and prove that every local maximum of OP(p) is a solution of (BSE) in sense that it extracts one source signal from a linear mixture of unknown statistically independent signals. An algorithm for solving OP(p) is constructed, which has a rate of convergence p?1.     

Decompositions,Partitions, and Coverings with Convex Polygons and Pseudo-Triangles

We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangles. This pseudo-convex decomposition is significantly sparser than either convex decompositions or pseudo-triangulations for planar point sets and simple polygons. We also introduce pseudo-convex partitions and coverings. We establish some basic properties and give combinatorial bounds on their complexity. Our upper bounds depend on new Ramsey-type results concerning disjoint empty convex k-gons in point sets.     

The Fixed Point of a Generalization of the Renormalization Group Maps for Self-Avoiding Paths on Gaskets

Let W(x,y) = ax ³+ bx ⁴+ f ₅ x ⁵+ f ₆ x ⁶+ (3 ax ²)² y+ g ₅ x ⁵ y + h ₃ x ³ y ² + h ₄ x ⁴ y ² + n ₃ x ³ y ³+a ₂₄ x ² y ⁴+a ₀₅ y ⁵+a ₁₅ xy ⁵+a ₀₆ y ⁶, and X = , , where the coefficients are non-negative constants, with a > 0, such that X ²(x,x ²)−Y(x,x ²) is a polynomial of x with non-negative coefficients. Examples of the 2 dimensional map Φ: (x,y)↦ (X(x,y),Y(x,y)) satisfying the conditions are the renormalization group (RG) maps (modulo change of variables) for the restricted self-avoiding paths on the 3 and 4 dimensional pre-gaskets. We prove that there exists a unique fixed point (x _f ,y _f ) of Φ in the invariant set . 2000 Mathematics Subject Classification Numbers: 82B28; 60G99; 81T17; 82C41.     

K3 surfaces,Picard numbers and Siegel disks

If a K3 surface admits an automorphism with a Siegel disk, then its Picard number is an even integer between 0 and 18. Conversely, using the method of hypergeometric groups, we are able to construct K3 surface automorphisms with Siegel disks that realize all possible Picard numbers. The constructions involve extensive computer searches for appropriate Salem numbers and computations of algebraic numbers arising from holomorphic Lefschetz-type fixed point formulas and related Grothendieck residues.     

Design of a coated thinly clad chalcogenide long-period fiber grating refractive index sensor based on dual-peak resonance near the phase matching turning point

A novel method for designing chalcogenide long-period fiber grating (LPFG) sensors based on the dual-peak resonance effect of the LPFG near the phase matching turning point (PMTP) is presented. Refractive index sensing in a high-refractive-index chalcogenide fiber is achieved with a coated thinly clad film. The dual-peak resonant characteristics near the PMTP and the refractive index sensing properties of the LPFG are analyzed first by the phase-matching condition of the LPFG. The effects of film parameters and cladding radius on the sensitivity of refractive index sensing are further discussed. The sensor is optimized by selecting the appropriate film parameters and cladding radius. Simulation results show that the ambient refractive index sensitivity of a dual-peak coated thinly clad chalcogenide LPFG at the PMTP can be 2400 nm/RIU, which is significantly higher than that of non-optimized gratings. It has great application potential in the field of chemical sensing and biosensors.     

Uniqueness and stability of slowly oscillating periodic solutions of delay equations with bounded nonlinearity

We study slowly oscillating periodic solutions of delay equations with small parameters. When the nonlinearity has finite and nonzero limits at infinities, the appearance of these solutions and their periods can be found though asymptotic analysis. Under further natural assumptions on the nonlinearity, we prove that slowly oscillating periodic solutions are unique and asymptotically stable when parameters are sufficiently small.